Amenable cones: error bounds without constraint qualifications
نویسندگان
چکیده
منابع مشابه
Newton-Type Methods for Optimization Problems without Constraint Qualifications
We consider equality-constrained optimization problems, where a given solution may not satisfy any constraint qualification but satisfies the standard second-order sufficient condition for optimality. Based on local identification of the rank of the constraints degeneracy via the singular-value decomposition, we derive a modified primal-dual optimality system whose solution is locally unique, n...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملStability of error bounds for convex constraint
5 This paper studies stability of error bounds for convex constraint systems 6 in Banach spaces. We show that certain known sufficient conditions for local 7 and global error bounds actually ensure error bounds for the family of func8 tions being in a sense small perturbations of the given one. A single inequality 9 as well as semi-infinite constraint systems are considered. 10 Mathematics Subj...
متن کاملConstraint Qualifications for Nonlinear Programming
This paper deals with optimality conditions to solve nonlinear programming problems. The classical Karush-Kuhn-Tucker (KKT) optimality conditions are demonstrated through a cone approach, using the well known Farkas’ Lemma. These conditions are valid at a minimizer of a nonlinear programming problem if a constraint qualification is satisfied. First we prove the KKT theorem supposing the equalit...
متن کاملError bounds for multiquadrics without added constants
While it was noted by R. Hardy and proved in a famous paper by C. A. Micchelli that radial basis function interpolants s(x) = ∑ λjφ(‖x − xj‖) exist uniquely for the multiquadric radial function φ(r) = √ r2 + c2 as soon as the (at least two) centres are pairwise distinct, the error bounds for this interpolation problem always demanded an added constant to s. By using Pontryagin native spaces, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2019
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-019-01439-3